Subset-sum phase transitions and data compression
نویسندگان
چکیده
منابع مشابه
Subset sum phase transitions and data compression
We propose a rigorous analysis approach for the subset sum problem in the context of lossless data compression, where the phase transition of the subset sum problem is directly related to the passage between ambiguous and non–ambiguous decompression, for a compression scheme that is based on specifying the sequence composition. The proposed analysis lends itself to straightforward extensions in...
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Subset-sum phase transitions and data compression
We propose a rigorous analysis approach for the subset sum problem in the context of lossless data compression, where the phase transition of the subset sum problem is directly related to the passage between ambiguous and non–ambiguous decompression, for a compression scheme that is based on specifying the sequence composition. The proposed analysis lends itself to straightforward extensions in...
متن کاملData Sketches for Disaggregated Subset Sum Estimation
We introduce and study a new data sketch for processing massive datasets. It addresses two common problems: 1) computing a sum given arbitrary lter conditions and 2) identifying the frequent items or heavy hiers in a data set. For the former, the sketch provides unbiased estimates with state of the art accuracy. It is specically designed to handle the challenging scenario when the data is di...
متن کاملData Sketches for Disaggregated Subset Sum and Frequent Item Estimation
We introduce and study a new data sketch for processing massive datasets. It addresses two common problems: 1) computing a sum given arbitrary filter conditions and 2) identifying the frequent items or heavy hitters in a data set. For the former, the sketch provides unbiased estimates with state of the art accuracy. It handles the challenging scenario when the data is disaggregated. In this cas...
متن کاملMultidimensional Subset Sum Problem
This thesis explores new modifications to the successful LLL approach to solving the Subset Sum problem. This work is an optimization of the matrix representation of an instance. Traditionally, the basis matrix contained only one column with set elements and the sum. In this thesis we suggest having several data columns (thus introducing multidimensionality). This allows us to reduce the size o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2011
ISSN: 1742-5468
DOI: 10.1088/1742-5468/2011/09/p09017